Implementing Bounded Revision via Lexicographic Revision and C-revision

نویسندگان

چکیده

New information in the context of real life settings usually is accompanied by some kind supplementary that indicates context, reliability, or expertise information's source. Bounded Revision (BR) displays an iterated belief revision mechanism takes as input a new reference sentence acting information, which specifies depth with shall be integrated posterior state. The worlds prior state are affected change mechanism. We show can characterized three simple, yet elegant postulates and corresponds to special case lexicographic revision, inherits all relevant features BR. Furthermore, we present methodological implementations BR including conditional c-revisions, making it directly usable for tools.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

self-revision and third party revision in translation

اهمیت این پژوهش در آن بود که به گفت? بسیاری از پژوهشگرانِ حوز? بازبینی ترجمه، ادبیات موجود در این زمینه به لحاظ نظری و عملی چندان قوی نیست و بخش های موجود نیز برداشت مناسبی از این مرحل? فرایند ترجمه ندارند، اگرچه اخیراً توجه به آن به صورت نظام مند افزایش یافته است. در عین حال، پژوهش های موجود از یک سو بر دگربازبینی بیشتر از خودبازبینی تأکید دارند و از دیگر سو تنها به لحاظ نظری به این موضوع می پرد...

15 صفحه اول

Resource Bounded Belief Revision

The AGM paradigm for belief revision provides a very elegant and powerful framework to reason about idealized agents. The paradigm assumes that the modelled agent is a perfect reasoner with innnite memory. In this paper we propose a framework to reason about non-ideal agents that generalizes the AGM paradigm. We rst introduce a structure to represent an agent's belief states that distinguishes ...

متن کامل

The lexicographic closure as a revision process

The connections between nonmonotonic reasoning and belief revision are well-known. A central problem in the area of nonmonotonic reasoning is the problem of default entailment, i.e., when should an item of default information representing “if θ is true then, normally, φ is true” be said to follow from a given set of items of such information. Many answers to this question have been proposed but...

متن کامل

Parody: Another Revision

The vast diversity of the proposed definitions of parody, both before and after the twentieth century, can be an emblem of the lack of a thorough agreement amongst the literary critics about the definition of this literary technique (genre?!). While there is not a comprehensive all-accepted definition of parody, modern and postmodern literatures both exhibit a wide application of it. After look...

متن کامل

Belief Revision with Bounded Treewidth

Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, with the ones by Dalal or Satoh being two of the most fundamental ones. As is well known, most computational tasks in this area are intractable. Therefore, in practical applications, one requires sufficient conditions ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2023

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v37i5.25802